Close
Metadata

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Repositorysid.inpe.br/marciana/2004/06.24.10.44   (restricted access)
Last Update2004:06.25.03.00.00 (UTC) marciana
Metadata Repositorysid.inpe.br/marciana/2004/06.24.10.44.50
Metadata Last Update2018:06.05.01.20.54 (UTC) administrator
Secondary KeyINPE-10751-PRE/6209
DOI10.1111/j.1475-3995.2004.00458.x
ISBN/ISSNOnline ISSN: 1475-3995
ISSN0969-6016
Citation KeyYanasseLime:2004:ReEnSc
TitleRefinements on an enumeration scheme for solving a pattern sequencing problem
ProjectOtimização combinatória, algorítmos e heurísticas
Year2004
Access Date2024, May 19
Secondary TypePRE PI
Number of Files2
Size165 KiB
2. Context
Author1 Yanasse, Horácio Hideki
2 Limeira, Marcelo Saraiva
Resume Identifier1 8JMKD3MGP5W/3C9JHCP
Group1 LAC-INPE-MCT-BR
2 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
2 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
JournalInternational Transactions in Operational Research
Volume11
Pages277-292
History (UTC)2006-09-28 22:27:44 :: administrator -> marciana ::
2008-02-19 11:58:59 :: marciana -> banon ::
2009-07-22 14:44:30 :: banon -> administrator ::
2012-10-21 18:07:49 :: administrator -> marciana :: 2004
2012-11-10 16:48:44 :: marciana -> administrator :: 2004
2018-06-05 01:20:54 :: administrator -> marciana :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsCOMPUTER SCIENCE
Sequencing problem
Open orders minimization
Branch-and-bound
Gate matrix layout
Programmable logic array folding
COMPUTAÇÃO APLICADA
Problema de sequenciamento
Minimização dos pedidos abertos
Lógica de programação
AbstractWe introduce some re.nements on a branch- and bound-scheme for solving the minimization of open stack problem (MOSP). After representing the MOSP as a graph traversing problem, we attempt to divide the graph into parts aiming to solve the resulting subgraphs independently in order to reduce the search in the branching scheme. Subgraphs with special topologies (such as trees) are solved exactly using polynomial time algorithms. The branching scheme is applied only to the parts that are complex. The re.nements introduced produce substantial savings in computational time when the MOSP graph presents some special structures. Limited computational results are presented.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Refinements on an...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filehoracio.PDF
User Groupadministrator
marciana
Reader Groupadministrator
marciana
Visibilityshown
Copyright Licensesid.inpe.br/marciana/2004/06.25.11.37
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Parent Repositoriessid.inpe.br/marciana/2004/06.25.11.37
Next Higher Units8JMKD3MGPCW/3ESGTTP
Citing Item Listsid.inpe.br/mtc-m21/2012/07.13.14.50 1
URL (untrusted data)http://www.blackwellpublishing.com/journal.asp?ref=0969-6016&site=1
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal archivist callnumber creatorhistory descriptionlevel e-mailaddress electronicmailaddress format identifier isbn label lineage mark mirrorrepository month nextedition notes number orcid parameterlist previousedition previouslowerunit progress rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork
7. Description control
e-Mail (login)marciana
update 


Close